Dantzig-Wolfe Reformulations for the Stable Set Problem
نویسندگان
چکیده
Dantzig-Wolfe reformulation of an integer program convexifies a subset of the constraints, which yields an extended formulation with a potentially stronger linear programming (LP) relaxation than the original formulation. This paper is part of an endeavor to understand the strength of such a reformulation in general. We investigate the strength of Dantzig-Wolfe reformulations of the classical edge formulation for the maximum weighted stable set problem. Since every constraint in this model corresponds to an edge of the underlying graph, a Dantzig-Wolfe reformulation consists of choosing a subgraph and convexifying all constraints corresponding to edges of this subgraph. We characterize Dantzig-Wolfe reformulations not yielding a stronger LP relaxation (than the edge formulation) as reformulations where this subgraph is bipartite. Furthermore, we analyze the structure of facets of the stable set polytope and present a characterization of Dantzig-Wolfe reformulations with the strongest possible LP relaxation as reformulations where the chosen subgraph contains all odd holes (and 3-cliques). To the best of our knowledge, these are the first non-trivial general results about the strength of relaxations obtained from decomposition methods, after Geoffrion’s seminal 1974 paper about Lagrangian relaxation.
منابع مشابه
Dantzig Wolfe decomposition and objective function convexification for binary quadratic problems: the cardinality constrained quadratic knapsack case
The purpose of this paper is to provide strong reformulations for binary quadratic problems. We propose a first methodological analysis on a family of reformulations combining Dantzig-Wolfe decomposition and Quadratic Convex Reformulation principles. As a representative case study, we apply them to a cardinality constrained quadratic knapsack problem, providing extensive experimental insights. ...
متن کاملFlow Shop Scheduling with Earliness, Tardiness and Intermediate Inventory Holding Costs
We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding) and intermediate (work-in-process) inventory holding costs. We formulate this problem as an integer program, and based on approximate solutions to two different, but closely related, Dantzig-Wolfe reformulations, we develop heur...
متن کاملReformulation and Decomposition of Integer Programs
We examine ways to reformulate integer and mixed integer programs. Typically, but not exclusively, one reformulates so as to obtain stronger linear programming relaxations, and hence better bounds for use in a branch-and-bound based algorithm. First we cover reformulations based on decomposition, such as Lagrangean relaxation, the Dantzig-Wolfe reformulation and the resulting column generation ...
متن کاملA stabilized structured Dantzig-Wolfe decomposition method
We present an algorithmic scheme, which we call the Structured Dantzig-Wolfe decomposition method, that can be used for solving large-scale structured Linear Programs (LPs). The required structure of the LPs is the same as in the original DantzigWolfe approach, that is, a polyhedron over which optimization is “easy” plus a set of “complicating” constraints. Under the hypothesis that an alternat...
متن کاملSubgradient Optimization in Nonsmooth Optimization ( including the Soviet Revolution )
Convex nondifferentiable, also known as convex nonsmooth, optimization (NDO) looks at problems where the functions involved are not continuously differentiable. The gradient does not exist, implying that the function may have kinks or corner points, and thus cannot be approximated locally by a tangent hyperplane, or by a quadratic approximation. Directional derivatives still exist because of th...
متن کامل